Data analyses or problem formulations?
نویسندگان
چکیده
منابع مشابه
Vehicle Routing Problem with Simultaneous Pickup and Delivery: Mixed Integer Programming Formulations and Comparative Analyses
This paper addresses the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) which is the problem of optimally integrating goods deliver and pickup when there are no precedence restrictions on the order in which the operations must be performed. We review mixed integer programming formulations in the literature for VRPSPD and propose two new formulations, PM1 and PM2, for the...
متن کاملWeak Symmetries in Problem Formulations
In this article we will present some problems that have weak symmetries. In contrast to a proper symmetry, a weak symmetry acts only on a subset of the variables and preserves the feasibility state only with respect to a subset of the constraints. Therefore, breaking weak symmetries with standard techniques would lead to a loss of solutions. This article presents also a modelling technique whic...
متن کاملMultiple analyses in clinical trials: sound science or data dredging?
ber 8 • 18 October 2004 452 MJA • Volume 181 Num NHMRC Clinical Trials Centre, University of Sydney, Sydney, NSW. Sarah J Lord, MB BS, MScEpid, Research Fellow; Val J Gebski, BA, MStat, Associate Professor and Principal Research Fellow; Anthony C Keech, MScEpid, FRACP, Deputy Director. Reprints will not be available from the authors. Correspondence: Dr Sarah J Lord, NHMRC Clinical Trials Centre...
متن کاملMIP Formulations for the Steiner Forest Problem
The Steiner Forest problem is among the fundamental network design problems. Finding tight linear programmming bounds for the problem is the key for both fast Branch-and-Bound algorithms and good primal-dual approximations. On the theoretical side, the best known bound can be obtained from an integer program by Könemann, Leonardi, Schäfer and van Zwam [KLSv08]. It guarantees a value that is a (...
متن کاملFlow Formulations for the Student Scheduling Problem
We discuss the student scheduling problem as it generally applies to high-schools in North-America. We show that the problem is NP-hard and discuss various variations to its formulation. We focus on multi-commodity flow problems because there has recently been much work and a number of interesting results on approximates solutions to such problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemometrics
سال: 1995
ISSN: 0886-9383,1099-128X
DOI: 10.1002/cem.1180090309